Chemnitz Scientific Computing Preprints

This paper is devoted to the fast solution of interface concentrated finite element equations. The interface concentrated finite element schemes are constructed on the basis of a non-overlapping domain decomposition where a conforming boundary concentrated finite element approximation is used in every subdo-main. Similar to data-sparse boundary element domain decomposition methods the total number of unknowns per subdomain behaves like O((H/h) (d−1)), where H, h, and d denote the usual scaling parameter of the subdomains, the average discretization parameter of the subdomain boundaries, and the spatial dimension, respectively. We propose and analyze primal and dual substructur-ing iterative methods which asymptotically exhibit the same or at least almost the same complexity as the number of unknowns. In particular, the so-called All-Floating Finite Element Tearing and Interconnecting solvers are highly parallel and very robust with respect to large coefficient jumps.